package 领扣算法.AA中等题.买钢笔和铅笔的方案数;

public class Main {
    public long waysToBuyPensPencils(int total, int cost1, int cost2) {
        long count=0L;
        for (int i = 0; i <= total/cost1; i++) {
            count+=(total-cost1*i)/cost2+1;

        }
        return count;
    }
}
